Constraint Answer Set Programming versus Satisfiability Modulo Theories Or Constraints versus Theories
نویسندگان
چکیده
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of Satisfiability Modulo Theories. Yet the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we make the link between these two areas precise.
منابع مشابه
Constraint Answer Set Programming versus Satisfiability Modulo Theories
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of Satisfiability Modulo Theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we make the link between these two areas precise.
متن کاملOn relation between constraint answer set programming and satisfiability modulo theories
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we connect these two research areas by uncovering the pr...
متن کاملSystem Description: SMT-based Constraint Answer Set Solver EZSMT
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. Recently, the formal link between this research area and satisfiability modulo theories (or SMT) was established. This link allows the cross-fertilization between traditionally different solving technologies. The paper presents the system EZSMT, one of the first...
متن کاملThe Role of Functions in the Stable Model Semantics
The rich modelling capabilities and efficient solvers of ASP have enabled the successful application of ASP to many domains. However, due to an issue called the “grounding bottleneck” that arises especially in numeric domains, ASP still faces some challenges in being applied to such domains. Recent work has considered hybrid approaches, using a combination of ASP and other KR formalisms includi...
متن کاملSatisfiability Modulo Constraint Handling Rules (Extended Abstract)
Satisfiability Modulo Constraint Handling Rules (SMCHR) is the integration of the Constraint Handling Rules (CHRs) solver programming language into a Satisfiability Modulo Theories (SMT) solver framework. Constraint solvers are implemented in CHR as a set of high-level rules that specify the simplification (rewriting) and constraint propagation behavior. The traditional CHR execution algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015